Problem Solver

Aerodynamic Design Optimization Using Genetic Algorithm (RESEARCH NOTE)

An efficient formulation for the robust shape optimization of aerodynamic objects is introduced in this paper. The formulation has three essential features. First, an Euler solver based on a second-order Godunov scheme is used for the flow calculations. Second, a genetic algorithm with binary number encoding is implemented for the optimization procedure. The third ingredient of the procedure is...

A Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem

In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...

Incorporating Simplex Method into Guided Complete Search: An Application to the Nurse Rostering Problem

Guided Complete Search (GCS) is a generic framework for combining and coordinating a tree search solver and a secondary solver to yield a complete and efficient CSP solver. The primary solver of GCS is systematic tree search augmented with constraint propagation algorithm, which is used to maintain the completeness of the GCS solver. The secondary solver of GCS can either be a complete or incom...

Radiation modeling of a turbulent diffusion flame in diesel engine

The purpose of this study is to investigate the effect of radiation heat transfer on temperature distribution and heat flux to the walls of a diesel engine. A diffusion flame is modeled in a simple cylindrical geometry and boundary conditions are defined. A specific solver which can model the turbulent diffusion flame by considering radiation in participating media is used to solve the problem....

Domain Problem Solver Layer Domain Problem Solver

GHOST: A Combinatorial Optimization Solver for RTS-related Problems

This paper presents GHOST, a combinatorial optimization solver an RTS AI developer can use as a blackbox to solve any problems encoded by a constraint satisfaction/optimization problem. We show a way to model three very different RTS problems by a constraint satisfaction/optimization problem, each problem belonging to a specific level of abstraction, and test our solver on them, using StarCraft...